The Linear 2- and 4-Arboricity of Complete Bipartite Graph Km,n
نویسندگان
چکیده
منابع مشابه
The Linear 4-arboricity of Balanced Complete Bipartite Graphs
A linear k-forest is a graph whose components are paths of length at most k. The linear k-arboricity of a graph G, denoted by lak(G), is the least number of linear k-forests needed to decompose G. In this paper, it is obtained that la4(Kn,n) = d5n/8e for n ≡ 0( mod 5).
متن کاملThe Linear and Cyclic Cutwidth of the Complete Bipartite Graph
We shall consider the problem of embedding the complete bipartite graph, Km,n, onto a linear and cyclic chassis in such a way as to minimize the cutwidth. The linear cutwidth of the complete bipartite graph is established and a partial solution to the cyclic cutwidth is presented. It is known that there is a paper in existance [3] that has established the linear cutwidth of the complete biparti...
متن کاملUniform coverings of 2-paths in the complete graph and the complete bipartite graph
Let G be a graph and H a subgraph of G. A D(G,H, λ) design is a collection D of subgraphs of G each isomorphic to H so that every 2-path (path of length 2) in G lies in exactly λ subgraphs in D. The problem of constructing D(Kn, Cn, 1) designs is the so-called Dudeney’s round table problem. We denote by Ck a cycle on k vertices and by Pk a path on k vertices. In this paper, we construct D(Kn,n,...
متن کاملon the effect of linear & non-linear texts on students comprehension and recalling
چکیده ندارد.
15 صفحه اولOn Subgraphs of the Complete Bipartite Graph
G(n) denotes a graph of n vertices and G(n) denotes its complementary graph. In a complete graph every two distinct vertices are joined by an edge. Let C k (G(n)) denote the number of complete subgraphs of k vertices contained in G(n). Recently it was proved [1] that for every k 2 (n) (1) min C (G (n)) + Ck(G(n)) < k k, , ! 2 2 where the minimum is over all graphs G(n). It seems likely that (1)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Combinatorics
سال: 2013
ISSN: 1687-9163,1687-9171
DOI: 10.1155/2013/501701